Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold

نویسندگان

  • Dimitris Achlioptas
  • Cristopher Moore
چکیده

Many NP-complete constraint satisfaction problems appear to undergo a “phase transition” from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds on the location of the threshold by showing that above a certain density the first moment (expectation) of the number of solutions tends to zero. We show that in the case of certain symmetric constraints, considering the second moment of the number of solutions yields nearly matching lower bounds for the location of the threshold. Specifically, we prove that the threshold for both random hypergraph 2-colorability (Property B) and random Not-All-Equal k-SAT is 2 ln 2−O(1). As a corollary, we establish that the threshold for random k-SAT is of order Θ(2), resolving a long-standing open problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Power of Choice for Random Satisfiability

We consider Achlioptas processes for k-SAT formulas. We create a semi-random formula with n variables and m clauses, where each clause is a choice, made on-line, between two or more uniformly random clauses. Our goal is to delay the satisfiability/unsatisfiability transition, keeping the formula satisfiable up to densities m/n beyond the satisfiability threshold αk for random k-SAT. We show tha...

متن کامل

Thresholds for Random Geometric k-SAT

We study two geometric models of random k-satisfiability which combine random k-SAT with the Random Geometric Graph: boolean literals are placed uniformly at random or according to a Poisson process in a cube, and for each set of k literals contained in a ball of a given radius, a clause is formed. For k = 2 we find the exact location of the satisfiability threshold (as either the radius or int...

متن کامل

Satisfying assignments of Random Boolean CSP: Clusters and Overlaps

The distribution of overlaps of solutions of a random CSP is an indicator of the overall geometry of its solution space. For random k-SAT, nonrigorous methods from Statistical Physics support the validity of the “one step replica symmetry breaking” approach. Some of these predictions were rigorously confirmed in [MMZ05a] [MMZ05b]. There it is proved that the overlap distribution of random k-SAT...

متن کامل

A sharp threshold for a random constraint satisfaction problem

We consider random instances I of a constraint satisfaction problem generalizing k-SAT: given n boolean variables, m ordered k-tuples of literals, and q “bad” clause assignments, find an assignment which does not set any of the k-tuples to a bad clause assignment. We consider the case where k = Ω(log n), and generate instance I by including every k-tuple of literals independently with probabili...

متن کامل

On Sharp Thresholds in Random Geometric Graphs

We give a characterization of vertex-monotone properties with sharp thresholds in a Poisson random geometric graph or hypergraph. As an application we show that a geometric model of random k-SAT exhibits a sharp threshold for satisfiability.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2006